Global convergence enhancement of classical linesearch interior point methods for MCPs
نویسندگان
چکیده
منابع مشابه
Global convergence of an inexact interior-point method for convex quadratic symmetric cone programming
In this paper, we propose a feasible interior-point method for convex quadratic programming over symmetric cones. The proposed algorithm relaxes the accuracy requirements in the solution of the Newton equation system, by using an inexact Newton direction. Furthermore, we obtain an acceptable level of error in the inexact algorithm on convex quadratic symmetric cone programmin...
متن کاملFailure of global convergence for a class of interior point methods for nonlinear programming
Using a simple analytical example, we demonstrate that a class of interior point methods for general nonlinear programming, including some current methods, is not globally convergent. It is shown that those algorithms do produce limit points that are neither feasible nor stationary points of some measure of the constraint violation, when applied to a well-posed problem.
متن کاملGlobal convergence analysis of line search interior point methods for nonlinear programming without regularity assumptions∗
It has been noticed by Wächter and Biegler that a number of interior point methods for nonlinear programming based on line search strategy may generate a sequence converging to an infeasible point. We show that by adopting a suitable merit function, a modified primal-dual equation, and a proper line search procedure, a class of interior point methods of line search type will generate a sequence...
متن کاملOn the Global Convergence of Interior-point Nonlinear Programming Algorithms
Abstract. Carathéodory’s lemma states that if we have a linear combination of vectors in R, we can rewrite this combination using a linearly independent subset. This lemma has been successfully applied in nonlinear optimization in many contexts. In this work we present a new version of this celebrated result, in which we obtained new bounds for the size of the coefficients in the linear combina...
متن کاملglobal convergence of an inexact interior-point method for convex quadratic symmetric cone programming
in this paper, we propose a feasible interior-point method for convex quadratic programming over symmetric cones. the proposed algorithm relaxes the accuracy requirements in the solution of the newton equation system, by using an inexact newton direction. furthermore, we obtain an acceptable level of error in the inexact algorithm on convex quadratic symmetric cone programmin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2003
ISSN: 0377-0427
DOI: 10.1016/s0377-0427(02)00745-8